﻿#include <iostream>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
int n;
vector<int> edges[N]; //存储树
int main()
{
	cin >> n;
	for (int i = 1; i < n; i++)
	{
		int a, b; cin >> a >> b;
		// a和b之间有⼀条边

			edges[a].push_back(b);
		edges[b].push_back(a);
	}
	return 0;
}
//#include<iostream>
//#include<deque>
//using namespace std;
//struct node {
//	int x, y, z;
//};
//int main()
//{
//	deque<node> q;
//	q.push_front({ 1,2,3 });
//	q.push_front({ 4,5,6 });
//
//	auto t = q.front(); 
//	cout << t.x << " " << t.y << " " << t.z << endl;
//	q.pop_front(); t = q.front();
//	cout << t.x << " " << t.y << " " << t.z << endl;
//
//	q.push_back({ 7,8,9 });
//	q.push_back({ 10,11,12 });
//
//	t = q.back(); 
//	cout << t.x << " " << t.y << " " << t.z << endl;
//	q.pop_back(); t = q.back();
//	cout << t.x << " " << t.y << " " << t.z << endl;
//	cout << "=================" << endl;
//	while (q.size())
//	{
//		t = q.back();
//		cout << t.x << " " << t.y << " " << t.z << endl;
//		q.pop_back();
//	}
//	return 0;
//}
////#include<iostream>
////#include<queue>
////using namespace std;
////const int N = 1e5 + 10;
////typedef pair<int, int>PII;
////
////queue<PII>q;
////int cnt[N];
////int kinds;
////int n; 
////int main()
////{
////	cin >> n;
////	while (n--)
////	{
////		int t, k; cin >> t >> k;
////		for (int i = 1; i <= k; i++)
////		{
////			int x; cin >> x;
////			q.push({ t,x });
////			if (cnt[x]++ == 0)kinds++;
////		}
////		while (q.size() && q.back().first - q.front().first >= 86400)
////		{
////			PII tmp = q.front(); q.pop();
////			int x = tmp.second;
////			if (cnt[x]-- == 1)kinds--;
////		}
////		cout << kinds << endl;
////	}
////	return 0;
////}
////int m, n;
////queue<int> q;
////bool st[N];
////
////int main()
////{
////	cin >> m >> n;
////	int cnt = 0;
////	for (int i = 1; i <= n; i++)
////	{
////		int x; cin >> x;
////		if (st[x])continue;
////
////		cnt++;
////		q.push(x);
////		st[x] = true;
////
////		if (q.size() > m)
////		{
////			st[q.front()] = false;
////			q.pop();
////		}
////	}
////
////	cout << cnt << endl;
////
////	return 0;
////}
////#include<iostream>
////using namespace std;
////const int N = 1e4 + 10;
////int q[N], h, t;
////int main()
////{
////	int n; cin >> n;
////	while (n--)
////	{
////		int op, x; cin >> op;
////		if (op == 1)
////		{
////			cin >> x;
////			q[t++]=x;
////		}
////		else if (op == 2)
////		{
////			if (h == t)cout << "ERR_CANNOT_POP" << endl;
////			else h++;
////		}
////		else if (op == 3)
////		{
////			if (h == t)cout << "ERR_CANNOT_QUERY" << endl;
////			else cout << q[h] << endl;
////		}
////		else
////		{
////			cout << -(h - t) << endl;
////		}
////	}
////	return 0;
////}
////#include <iostream>
////#include <stack>
////using namespace std;
////const int N = 110;
////bool st[N]; // 标记有没有匹配
////int main()
////{
////	string s; cin >> s;
////	int n = s.size();
////	stack<int> stk; // ⾥⾯存的是左括号的下标
////	string ret;
////	for (int i = 0; i < n; i++)
////    {
////        if (s[i] == '(' || s[i] == '[')
////        {
////            stk.push(i);
////        }
////        else
////        {
////            if (stk.empty()) continue;
////            char ch = s[stk.top()];
////            if ((ch == '(' && s[i] == ')') || (ch == '[' && s[i] == ']')) // 能匹配
////            {
////                st[stk.top()] = true;
////                st[i] = true;
////                stk.pop();
////            }
////        }
////    }
////    for (int i = 0; i < n; i++)
////    {
////        char ch = s[i];
////        if (st[i]) ret += ch;
////        else
////        {
////            // 不能匹配就要加括号
////                if (ch == '(')
////                {
////                    ret += ch;
////                    ret += ')';
////                }
////                else if (ch == ')')
////                {
////                    ret += '(';
////                    ret += ch;
////                }
////                else if (ch == '[')
////                {
////                    ret += ch;
////                    ret += ']';
////                }
////                else if (ch == ']')
////                {
////                    ret += '[';
////                    ret += ch;
////                }
////        }
////    }
////    cout << ret << endl;
////    return 0;
////}